Numerical solutions of Kendall and Pollaczek-Khintchin equations for exhaustive polling systems with semi-Markov delays
نویسندگان
چکیده
Some analytical results for exhaustive polling systems with semi-Markov delays, such as Pollaczek-Khintchin virtual and steady state analog are presented. Numerical solutions for k busy period, probability of states and queue length distribution are obtained. Numerical examples are presented.
منابع مشابه
Convergence of Numerical Method For the Solution of Nonlinear Delay Volterra Integral Equations
In this paper, Solvability nonlinear Volterra integral equations with general vanishing delays is stated. So far sinc methods for approximating the solutions of Volterra integral equations have received considerable attention mainly due to their high accuracy. These approximations converge rapidly to the exact solutions as number sinc points increases. Here the numerical solution of nonlinear...
متن کاملApplication of Markov Processes to the Machine Delays Analysis
Production and non-productive equipment and personnel delays are a critical element of any production system. The frequency and length of delays impact heavily on the production and economic efficiency of these systems. Machining processes in wood industry are particularly vulnerable to productive and non-productive delays. Whereas, traditional manufacturing industries usually operate on homoge...
متن کاملApproximation of discrete-time polling systems via structured Markov chains
We devise an approximation of the marginal queue length distribution in discrete-time polling systems with batch arrivals and fixed packet sizes. The polling server uses the Bernoulli service discipline and Markovian routing. The 1-limited and exhaustive service disciplines are special cases of the Bernoulli service discipline, and traditional cyclic routing is a special case of Markovian routi...
متن کاملNumerical Solution of Polling Systems for Analyzing Networks on Chips
This paper introduces a numerical solution method for a class of discrete-time polling systems by relying on the power method, Kronecker matrix representations and the shuffle algorithm. The class of polling models considered consists of several infinite pseudo queues, deterministic service times, Bernoulli service and Markovian routing and includes exhaustive, 1-limited and k-limited service a...
متن کاملA new positive definite semi-discrete mixed finite element solution for parabolic equations
In this paper, a positive definite semi-discrete mixed finite element method was presented for two-dimensional parabolic equations. In the new positive definite systems, the gradient equation and flux equations were separated from their scalar unknown equations. Also, the existence and uniqueness of the semi-discrete mixed finite element solutions were proven. Error estimates were also obtaine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The Computer Science Journal of Moldova
دوره 24 شماره
صفحات -
تاریخ انتشار 2016